On Replete Graphs
نویسنده
چکیده
A graph G is k-clique replete if G has clique number k and every elementary homomorphism of G has clique number greater than k . Results on the order of k-clique replete graphs are presented, and bounds for the minimum degree and the maximum degree of such graphs are discussed.
منابع مشابه
Biotic and abiotic predictors of tick (Dermacentor variabilis) abundance and engorgement on free-ranging raccoons (Procyon lotor).
We examined the relative importance of abiotic and biotic factors on the ability of adult Dermacentor variabilis ticks to attach and engorge with blood across 10 populations of free-ranging raccoons (Procyon lotor). We developed a priori models that represented explicit hypotheses based on the literature and tested the ability of these models to explain non-replete and replete (fully engorged w...
متن کاملHadamard Subtractions for Infrared Singularities in Quantum Field Theory
Feynman graphs in perturbative quantum field theory are replete with infrared divergences caused by the presence of massless particles, however these divergences are known to cancel order-by-order when all virtual and real contributions to a given cross section are summed and smeared against an experimental resolution. In this thesis we treat the infrared problem formally in the language of dis...
متن کاملOn the bandwidth of Mobius graphs
Bandwidth labelling is a well known research area in graph theory. We provide a new proof that the bandwidth of Mobius ladder is 4, if it is not a $K_{4}$, and investigate the bandwidth of a wider class of Mobius graphs of even strips.
متن کاملRemarks on Distance-Balanced Graphs
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
متن کاملD-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006